Papers with storage costs
SDR: Efficient Neural Re-ranking using Succinct Document Representation (2022.acl-long)
Copied to clipboard
| Challenge: | BERT based ranking models have been successful on various information retrieval tasks, but they are prone to storage and network fetching latency. |
| Approach: | They propose a late-interaction architecture that allows pre-computation of intermediate document representations, thus reducing latency. |
| Outcome: | The proposed model achieves 4x–11.6x higher compression rates on the MSMARCO passage re-reranking task compared to existing methods. |
VPTQ: Extreme Low-bit Vector Post-Training Quantization for Large Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent research has focused on pushing weight-only quantization to extremely low-bit due to numerical representation limitations. |
| Approach: | They propose a vector-based quantization approach that pushes LLMs to extremely low-bit . they propose scalar-based weight quantization that reduces memory requirements and optimizes storage costs . |
| Outcome: | The proposed method reduces model quantization perplexity by 0.01-0.34 on LLaMA-2, 0.38-0.68 on mistral-7B, 4.41-7.34, on llaMA-3 on QA tasks on average. |
RQT: Hierarchical Residual Quantization for Multi-Model Compression (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for decomposing fine-tuned LLMs are sensitive to the magnitude of delta values. |
| Approach: | They propose a hierarchical quantization framework that shares low-bit integer weights across similar models. |
| Outcome: | The proposed framework achieves an average accuracy degradation of approximately 3% on fine-tuned models across mathematics, coding, chatbot, and Chinese LLMs. |
Improving Efficiency in Large Language Models via Extendable Block Floating Point Representation (2025.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) are becoming more and more resource-intensive as their size increases. |
| Approach: | They propose a block floating-point (BFP) arithmetic representation that extends the exponent bit width to capture a wider dynamic range. |
| Outcome: | Extendable Exponent Sharing (EES) outperforms representative baselines in accuracy and computational efficiency. |
Redundancy, Isotropy, and Intrinsic Dimensionality of Prompt-based Text Embeddings (2025.findings-acl)
Copied to clipboard
| Challenge: | Prompt-based text embedding models generate task-specific embeddables but have thousands of dimensions . dimensionality reductions for embedded text can result in performance degradations of only the first 25% of the dimensions resulting in a very small degradation . |
| Approach: | They investigate how post-hoc dimensionality reduction affects performance of various tasks . they find that embeddings for classification and clustering exhibit lower intrinsic dimensionalities . |
| Outcome: | The proposed model generates task-specific embeddings upon receiving tailored prompts, but has thousands of dimensions and high storage costs. |
HydraOpt: Navigating the Efficiency-Performance Trade-off of Adapter Merging (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods that produce a fixed trade-off between storage size and performance are often ineffective due to the growing size of large language models. |
| Approach: | They propose a model merging technique that capitalizes on similarities between low-rank adapters to reduce storage costs and improve performance. |
| Outcome: | The proposed method significantly reduces storage size (48% reduction) while outperforms existing merging techniques in terms of performance (0.2-1.8% drop). |
Neural Parameter Search for Slimmer Fine-Tuned Models and Better Transfer (2025.acl-long)
Copied to clipboard
Guodong Du, Zitao Fang, Jing Li, Junlin Li, Runhua Jiang, Shuyang Yu, Yifei Guo, Yangneng Chen, Sim Kuan Goh, Ho-Kin Tang, Daojing He, Honghai Liu, Min Zhang
| Challenge: | Foundational models and their checkpoints have advanced deep learning, boosting performance across applications. |
| Approach: | They propose a method for pruning fine-tuned models by calculating differences between them and original model. |
| Outcome: | The proposed method can improve performance across vision, NLP, and multi-modal benchmarks. |